Cyclically closed pattern classes of permutations
نویسندگان
چکیده
The cyclic closure of a permutation pattern class is defined as the set of all the cyclic rotations of its permutations. Examples of finitely based classes whose cyclic closure is also finitely based are given, as well as an example where the cyclic closure is not finitely based. Some enumerations of cyclic closures are computed.
منابع مشابه
Sorting classes – Extended Abstract
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...
متن کاملSorting Classes
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...
متن کاملPattern Classes of Permutations
Though still a relatively young subject within discrete mathematics, the study of pattern classes of permutations is one of the fastest growing and is useful in theoretical computer science as well as various areas of mathematics. There are two commonly used forms of notation for permutations: a1a2 . . . an denotes the permutation which sends i to ai for i = 1, 2, . . . , n, where each ai repre...
متن کاملUniversal cycles for permutation classes
We define a universal cycle for a class of n-permutations as a cyclic word in which each element of the class occurs exactly once as an n-factor. We give a general result for cyclically closed classes, and then survey the situation when the class is defined as the avoidance class of a set of permutations of length 3, or of a set of permutations of mixed lengths 3 and 4. Résumé. Nous définissons...
متن کاملPermutation Classes of Polynomial Growth
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterized as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 38 شماره
صفحات -
تاریخ انتشار 2007